WAITING TIME CHARACTERISTICS IN CYCLIC QUEUES
نویسندگان
چکیده
منابع مشابه
Waiting time characteristics in cyclic queues
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
متن کاملQueues with waiting time dependent service
Motivated by service levels in terms of the waiting-time distribution seen, for instance, in call centers, we consider two models for systems with a service discipline that depends on the waiting time. The first model deals with a single server that continuously adapts its service rate based on the waiting time of the first customer in line. In the second model, one queue is served by a primary...
متن کاملPerceptions of Waiting Time in Different Service Queues (unpublished, 2005)
This article investigates the extent to which there is a gap between customers' perception of waiting time compared with actual waiting times; and whether this gap varies according to service context. It also investigates a new proposition that customers’ perception of time available for the service influences their perception of wait time. A field study collected 455 actual and perceived custo...
متن کاملEstimation Vehicular Waiting Time at Traffic Build-Up Queues
Due to the high growth of social economic activities and the increased need for mobility in recent days, transportation problems like congestion, accidents, and pollution have been increased. However, improving the reliability of delay estimates and real-time dissemination of information remains a challenge. An advanced border-crossing system corresponding to the changes of crossborder circumst...
متن کاملWaiting Time Analysis of Multi-class Queues with Impatient Customers
In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2004
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964804183022